Diffusion limits for the (MAPt/Pht/∞)N queueing network
نویسندگان
چکیده
In this paper, we prove strong approximations for the (MAPt/PHt/∞) queueing network. These strong approximations allow us to derive fluid and diffusion limits for the queue length processes of the network. This extends recent work by Ko and Pender [9], which provides fluid and diffusion limits in the single station setting.
منابع مشابه
Strong Approximations
In real stochastic systems, the arrival and service processes may not be renewal processes. For example, in many telecommunication systems such as internet traffic where data traffic is bursty, the sequence of inter-arrival times and service times are often correlated and dependent. One way to model this non-renewal behavior is to use Markovian Arrival Processes (MAP’s) and Markovian Service Pr...
متن کاملQueueing System: Part II—The Multiclass Network
W demonstrate a numerically exact method for evaluating the time-dependent mean, variance, and higherorder moments of the number of entities in the multiclass Pht/Pht/ K queueing network system, as well as at the individual network nodes. We allow for multiple, independent, time-dependent entity classes and develop time-dependent performance measures by entity class at the nodal and network lev...
متن کاملThe Pht/Pht/ Queueing System: Part I—The Single Node
W develop a numerically exact method for evaluating the time-dependent mean, variance, and higherorder moments of the number of entities in a Pht/Pht/ queueing system. We also develop a numerically exact method for evaluating the distribution function and moments of the virtual sojourn time for any time t; in our setting, the virtual sojourn time is equivalent to the service time for virtual en...
متن کاملA queueing model with independent arrivals, and its fluid and diffusion limits
We study a queueing model with ordered arrivals, which can be called the ∆(i)/GI/1 queue. Here, customers from a fixed, finite, population independently sample a time to arrive from some given distribution F , and enter the queue in order of the sampled arrival times. Thus, the arrival times are order statistics, and the inter-arrival times are differences of consecutive ordered statistics. The...
متن کاملFluid and Diffusion Approximations of a Two-Station Mixed Queueing Network
The subject of this paper is a two-station mixed queueing network with two customer types: "Open" customers enter the network at station 1 and depart the system after receiving service. Meanwhile, a fixed number of "closed" customers circulate between stations 1 and 2 indefinitely. Such a mixed queueing network model can represent a single-stage production system that services both make-to-orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 45 شماره
صفحات -
تاریخ انتشار 2017